On the exact solution of vehicle routing problems with backhauls
نویسندگان
چکیده
منابع مشابه
An Innovative Metaheuristic Solution Approach for the Vehicle Routing Problem with Backhauls
This paper deals with a practical transportation model known as the Vehicle Routing Problem with Backhauls (VRPB), which aims at designing the minimum cost route set for satisfying both delivery and pick-up demands. In methodological terms, we propose a local search metaheuristic which explores rich solution neighborhoods composed of exchanges of variable-length customer sequences. To efficient...
متن کاملA vehicle routing problem with backhauls and time windows: a guided local search solution
This paper presents a guided local search heuristic to solve a vehicle routing problem with backhauls and time windows. The VRPBTW with and without customer precedence are both considered. Customer precedence requires that all linehaul customers be visited before any backhaul customer. The basic approach is to construct an initial infeasible solution and then use a guided local search to improv...
متن کاملA heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
We consider an extension of the capacitated Vehicle Routing Problem (VRP), known as the Vehicle Routing Problem with Backhauls (VRPB), in which the set of customers is partitioned into two subsets: Linehaul and Backhaul customers. Each Linehaul customer requires the delivery of a given quantity of product from the depot, whereas a given quantity of product must be picked up from each Backhaul c...
متن کاملA unified heuristic for a large class of Vehicle Routing Problems with Backhauls
The Vehicle Routing Problem with Backhauls is a generalization of the ordinary capacitated vehicle routing problem where goods are delivered from the depot to the linehaul customers, and additional goods are brought back to the depot from the backhaul customers. Numerous ways of modeling the backhaul constraints have been proposed in the literature, each imposing different restrictions on the h...
متن کاملExact Algorithms for Electric Vehicle-Routing Problems with Time Windows
Effective route planning for battery electric commercial vehicle (ECV) fleets has to take into account their limited autonomy and the possibility of visiting recharging stations during the course of a route. In this paper, we consider four variants of the electric vehicle-routing problem with time windows: (i) at most a single recharge per route is allowed, and batteries are fully recharged on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2020
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2020.04.047